DISCRETE SEARCH ALLOCATION GAME WITH ENERGY CONSTRAINTS
نویسندگان
چکیده
منابع مشابه
The Search Allocation Game
An ultimate purpose of search theory is to answer how efficiently we could find targets. In search theory, there are two main players: searchers and targets. As operations research (OR) was born in World War II as a realistic academia, search theory originated from the military research of the Anti-Submarine Warfare Operations Research Group (ASWORG) of the U.S. Navy for anti-submarine warfare ...
متن کاملLinear Discrete Pursuit Game with Phase Constraints
We consider a linear pursuit game of one pursuer and one evader whose motions are described by different-type linear discrete systems. Position of the evader satisfies phase constraints: y∈G, where G is a subset of Rn. We considered two cases: (1) controls of the players satisfy geometric constraints, and (2) controls of the players satisfy total constraints. Terminal set M is a subset of Rn an...
متن کاملOptimal Energy Allocation for Linear Control over a Packet-Dropping Link with Energy Harvesting Constraints
A sensor computes a state estimate of a closed loop linear control system. The state estimate is packetized and sent to the controller in the receiver block over a randomly time-varying (fading) packet dropping link. The receiver sends an ACK/NACK packet to the transmitter over a perfect feedback channel. The energy used in packet transmission depletes a battery of limited capacity at the senso...
متن کاملOn Oligopoly Spectrum Allocation Game in Cognitive Radio Networks with Capacity Constraints
Dynamic spectrum sharing is a promising technology to improve spectrum utilization in the future wireless networks. The flexible spectrum management provides new opportunities for licensed primary user and unlicensed secondary users to reallocate the spectrum resource efficiently. In this paper, we present an oligopoly pricing framework for dynamic spectrum allocation in which the primary users...
متن کاملAscending Combinatorial Auctions with Allocation Constraints: On Game Theoretical and Computational Properties of Generic Pricing Rules
Combinatorial auctions are used in a variety of application domains such as transportation or industrial procurement using a variety of bidding languages and different allocation constraints. This flexibility in the bidding languages and the allocation constraints is essential in these domains, but has not been considered in the theoretical literature so far. In this paper, we analyze different...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Operations Research Society of Japan
سال: 2002
ISSN: 0453-4514,2188-8299
DOI: 10.15807/jorsj.45.93